منابع مشابه
Shortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملShortest Paths between Shortest Paths and Independent Sets
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. Moreover, we also study reconfiguration of independent sets in three different models and analyze relati...
متن کاملShortest paths on a polyhedron, Part I: Computing shortest paths
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algo...
متن کاملUpdating Shortest Paths
Moving target search is a state space approach for nding non-stationary goals. The plot is given by a realtime situation in which the target has to be captured by a so-called problem solver. The model chosen in the trailblazer search allows the problem solver to maintain a map of the explored graph and to move faster than the target. Within this map the shortest paths to a current position are ...
متن کاملNear-shortest and K-shortest simple paths
We describe a new algorithm for solving the problem of enumerating all nearshortest simple (loopless) s-t paths in a graph G = (V,E) with non-negative edge lengths. Letting n = |V | and m = |E|, the time per path enumerated is O(nS(n,m)) given a user-selected shortest-path subroutine with complexity O(S(n,m)). When coupled with binary search, this algorithm solves the corresponding K-shortest s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.021